An Innovative Scalar Multiplication Method Based on Improved m-ary
نویسندگان
چکیده
On purpose to elevate the efficiency of elliptic curve scalar multiplication in the device with weak computation power and to improve computational security, in this paper we pioneer a novel algorithm named Improvedm-ary, which is based on the depth first addition chain scheme and the improved m-ary mechanism compatible with a flexible width window. At first, we research and analyze the advantages of addition-chain-method, m-ary and other algorithms respectively in terms of speeding computation by comparison. It is discovered that the proportion of atomic operation and window width are 2 key factors which keep the speed of scalar multiplication and its computation cost in a leash. Then, an innovative scalar-point-multiplication algorithm is designed by the project crew on the basis of findings of project research. At last, the results of theoretical analysis and experimentation statistics demonstrate that by this algorithm the average of hamming weight of the scalar as a multiplicator could be undercut and the computation cost of point-scalar-multiplication could be lowered to an amazing extent. In addition, because of its built-in scheme whereby the window width is randomized constantly it presents a favorable strong immunity against most attack methods hinged on power analysis . As a whole, it is potential that Improved-m-ary be a practical and promising fast scalar multiplication method alternative.
منابع مشابه
m-Ary Hypervector Space: Convergent Sequences and Bundle Subsets.
In this paper, we have generalized the definition of vector space by considering the group as a canonical $m$-ary hypergroup, the field as a krasner $(m,n)$-hyperfield and considering the multiplication structure of a vector by a scalar as hyperstructure. Also we will be consider a normed $m$-ary hypervector space and introduce the concept of convergence of sequence on $m$-ary hypernormed space...
متن کاملIterative sliding window method for shorter number of operations in modular exponentiation and scalar multiplication
Cryptography via public key cryptosystems (PKC) has been widely used for providing services such as confidentiality, authentication, integrity and non-repudiation. Other than security, computational efficiency is another major issue of concern. And for PKC, it is largely controlled by either modular exponentiation or scalar multiplication operations such that found in RSA and elliptic curve cry...
متن کاملScalar Multiplication on Koblitz Curves using tau2-NAF
The paper proposes a τ−NAF method for scalar multiplication on Koblitz curves, which requires asymptotically 0.215m point additions in GF (2). For τ−NAF method, point quading operation (a→ a) is performed instead of point squarings. The proposed method is faster than normal τ−NAF method, which requires around m 3 point additions. However, like width w based τ−NAF methods, there is an overhead o...
متن کاملThere's Something about m-ary - Fixed-Point Scalar Multiplication Protected against Physical Attacks
In this paper, we study the fixed-point scalar multiplication operation on elliptic curves in the context of embedded devices prone to physical attacks. We propose efficient algorithms based on Yao and BGMW algorithms that are suited for embedded computing, with various storage-efficiency trade-offs. In particular, we study their security towards side-channel and fault analysis and propose a se...
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSW
دوره 7 شماره
صفحات -
تاریخ انتشار 2012